\relax 
\catcode`.\active
\catcode`\.=12
\catcode`"\active
\catcode`<\active
\catcode`>\active
\es@quoting
\catcode`'\active
\select@language{spanish}
\@writefile{toc}{\select@language{spanish}}
\@writefile{lof}{\select@language{spanish}}
\@writefile{lot}{\select@language{spanish}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introducci\'on}{4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Aplicaciones en la vida real}{4}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Algoritmo Exacto}{5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Enunciado}{5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}Desarrollo de la soluci\'on}{5}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1}Detalles de implementaci\'on}{5}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces $void$ $cantidadCruces():$}}{5}}
\newlabel{$insertar(ArrayList<Node> v, int i, int j)$}{{1}{5}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2}Algoritmo exacto}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Pseudo-C\'odigo}{6}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces $void$ $exacto(Arreglo<Node>$ $v1,$ $Arreglo<Node>$ $fijosV1,$ $Arreglo<Node>$ $v2,$ $Arreglo<Node>$ $fijosV2,$ $):$}}{6}}
\newlabel{$insertar(ArrayList<Node> v, int i, int j)$}{{2}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.4}C\'alculo de Complejidad}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.4.1}Tama\~no de entrada}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.5}Gr\'aficos de Complejidad}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.6}Conclusiones}{10}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.7}Instrucciones de Uso}{10}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Heur\IeC {\'\i }stica Constructiva}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Enunciado}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Introducci\'on Algoritmos Golosos}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Desarrollo de la soluci\'on}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Pseudo-C\'odigo}{12}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {3}{\ignorespaces $void$ $Constructivo(BiGrafo$ $big$:}}{12}}
\newlabel{$Constructivo(BiGrafo big)$}{{3}{12}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5}C\'alculo de Complejidad}{13}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {4}{\ignorespaces $void$ $CortesDeV1(Int PosNodo):$}}{13}}
\newlabel{$insertar(ArrayList<Node> v, int i, int j)$}{{4}{13}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {5}{\ignorespaces $void$ $CortesDeV2(Int PosNodo):$}}{14}}
\newlabel{$insertar(ArrayList<Node> v, int i, int j)$}{{5}{14}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.6}C\'alculo de Complejidad en Funci'on del Tama\~no de entrada}{15}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.7}Casos Malos}{15}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.8}Gr\'aficos de Complejidad}{16}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.9}Conclusiones}{16}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.10}Instrucciones de Uso}{16}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Heur\IeC {\'\i }stica Local}{17}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Introducci\'on Heur\IeC {\'\i }stica Local}{17}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Desarrollo de la soluci\'on}{17}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Pseudo-C\'odigo}{18}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {6}{\ignorespaces $int$ $Busqlocal(BiGrafo$ $big,$ $int$ $contador):$}}{18}}
\newlabel{$Busqlocal(BiGrafo big, int contador)$}{{6}{18}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}C\'alculo de Complejidad}{19}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.4.1}Tama\~no de entrada}{19}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.5}Gr\'aficos de Complejidad}{20}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.6}Pruebas}{21}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.6.1}Mejora con respecto a una soluci\'on aleatoria}{21}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.6.2}Soluci\'on Inicial - Random o golosa? }{21}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.6.3}Comparaci\'on del Algoritmo Goloso con la heur\IeC {\'\i }stica de B\'usqueda local }{23}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.7}Casos Malos}{24}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Familia de Grafos malos}}{24}}
\@writefile{lof}{\contentsline {subfigure}{\string\numberline{1(a)}{\ignorespaces Grafo Inicial}}{24}}
\@writefile{lof}{\contentsline {subfigure}{\string\numberline{1(b)}{\ignorespaces Soluci\'on \'optima}}{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.8}Conclusiones}{24}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Metaheur\IeC {\'\i }stica Grasp}{26}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Enunciado}{26}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Introducci\'on a Grasp}{26}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Desarrollo de la soluci\'on}{26}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.4}Pseudo-C\'odigo}{27}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {7}{\ignorespaces $void$ $grasp(BiGrafo$ $g,$ $int$ $porcentaje,$ $int$ $iteraciones):$}}{27}}
\newlabel{$grasp(BiGrafo g, int porcentaje, int iteraciones$}{{7}{27}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.5}C\'alculo de Complejidad}{27}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.5.1}Tama\~no de entrada}{27}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.6}Gr\'aficos de Complejidad}{27}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.7}Fijaci\'on de Par\'ametros}{27}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.7.1}Cantidad de Iteraciones}{29}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.7.2}Conclusiones}{31}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {5.7.3}Lista restringida de candidatos (LRC)}{31}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.8}Conclusiones}{31}}
